Of the Complexity of Boolean Network State Trajectories
نویسندگان
چکیده
We study the complexity of network dynamics in a couple of very different model classes: The traditional random Boolean networks (RBN) and Frisch-Hasslacher-Pomeau lattice gas automata (FHP). For this we formulate the FHP dynamics as a probabilistic Boolean network (PBN). We use the set complexity of successive network states to assess the complexity of the dynamics. We find that the complexity is maximised near a transition state in both types of dynamical systems.
منابع مشابه
AN APPLICATION OF TRAJECTORIES AMBIGUITY IN TWO-STATE MARKOV CHAIN
In this paper, the ambiguity of nite state irreducible Markov chain trajectories is reminded and is obtained for two state Markov chain. I give an applicable example of this concept in President election
متن کاملBasin entropy in Boolean network ensembles.
The information processing capacity of a complex dynamical system is reflected in the partitioning of its state space into disjoint basins of attraction, with state trajectories in each basin flowing towards their corresponding attractor. We introduce a novel network parameter, the basin entropy, as a measure of the complexity of information that such a system is capable of storing. By studying...
متن کاملMulti-Area State Estimation Based on PMU Measurements in Distribution Networks
State estimation in the energy management center of active distribution networks has attracted many attentions. Considering an increase in complexity and real-time management of active distribution networks and knowing the network information at each time instant are necessary. This article presents a two-step multi-area state estimation method in balanced active distribution networks. The prop...
متن کاملBoolean network robotics as an intermediate step in the synthesis of finite state machines for robot control
We propose an approach to the automatic synthesis of robot control software based on the finite state machine (FSM) formalism. In our previous research, we have introduced Boolean network robotics as a novel approach to the automatic design of robot control software. In this paper, we show that it is possible to leverage automatically designed Boolean networks to synthesize FSMs for robot contr...
متن کاملIdentification problems for Boolean networks and Boolean control networks
In this paper we address various forms of identification problems for Boolean networks (BNs) and for Boolean control networks (BCNs). For the former, we assume to have a set of infinite or finite support output trajectories and we want to identify a BN compatible with those trajectories. Conditions for the identified BN to coincide (up to a relabeling) with the original BN are provided. For BCN...
متن کامل